Comment on ‘Chance-constrained dynamic programing and optimization of water resource systems’ by Arthur J. Askew
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Sensitivity Analysis of Water Flooding Optimization by Dynamic Optimization
This study concerns the scope to improve water flooding in heterogeneous reservoirs. We used an existing, in-house developed, optimization program consisting of a reservoir simulator in combination with an adjoint-based optimal control algorithm. In particular we aimed to examine the scope for optimization in a two-dimensional horizontal reservoir containing a single high permeable streak, ...
متن کاملOn Resource Constrained Optimization Problems
This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.
متن کاملAmbiguous chance constrained problems and robust optimization
In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We focus primarily on the special case where the uncertainty set Q of the distributions is of the form Q = {Q : ρp(Q, Q0) ≤ β}, where ρp denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled pro...
متن کاملGlobal optimization of robust chance constrained problems
We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Water Resources Research
سال: 1975
ISSN: 0043-1397
DOI: 10.1029/wr011i006p01037